Random walk with jumps in large-scale random geometric graphs

Random walk with jumps in large-scale random geometric graphs

0140-3664/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.comcom.2010.01.026 q This work has been supported in part by the proje Architecture) (IST-27489), the PENED 2003 program Research and Technology (GSRT) co-financed by the and by National Sources (25%) and the NoE CONTENT * Corresponding author. Address: National and Kapo Department of Informatics and Telecommunications, I Tel.: +30...

A Random Walk with Exponential Travel Times

Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

Random walk attachment graphs

We consider the random walk attachment graph introduced by Saramäki and Kaski and proposed as a mechanism to explain how behaviour similar to preferential attachment may appear requiring only local knowledge. We show that if the length of the random walk is fixed then the resulting graphs can have properties significantly different from those of preferential attachment graphs, and in particular...

Large Deviations for Random Walk in Random

Two-boundary Problems for a Random Walk with Negative Geometric Jumps

Two-boundary problems for a random walk with negative geometric jumps are considered, and the corresponding results for a usual semicontinuous random walk are generalized for them. The following results are obtained: the probability distribution of ruin is found and expressed in terms of the lower and upper boundaries; formulas are given for the joint distribution of the infimum, supremum, and ...